Robust multiobjective optimisation for fuzzy job shop problems
نویسندگان
چکیده
منابع مشابه
Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer
In real-world manufacturing environments, it is common to face a job-shop scheduling problem (JSP) with uncertainty. Among different sources of uncertainty, processing times uncertainty is the most common. In this paper, we investigate the use of a multiobjective genetic algorithm to address JSPs with uncertain durations. Uncertain durations in a JSP are expressed by means of triangular fuzzy n...
متن کاملRobust solutions to Job Shop problems
The problem of finding robust solutions for scheduling problems is of utmost importance for realworld applications as they operate in dynamic environments. In such environments it is often necessary to reschedule the existing plan due to various failures (e.g., machine breakdowns, sickness of employees, etc). Thus a robust solution (i.e., a quality solution which can be modified easily accordin...
متن کاملCombining Neighbourhoods in Fuzzy Job Shop Problems
In the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan of the resulting schedule. The new neighbourhood structure is based on changing the position of a task in a critica...
متن کاملA Multiobjective Metaheuristic for Job-shop Scheduling
In this paper, we introduce a nature inspired meta-heuristic for scheduling jobs on computational grids. Our approach is to dynamically generate an optimal schedule so as to complete the tasks in a minimum period of time as well as utilizing the resources in an efficient way. The approach proposed is a variant of particle swarm optimization which uses mutation operator. The mutation operator ca...
متن کاملAnt Colony Optimisation for Job Shop Scheduling
A recent adaptive algorithm, named Ant System, is introduced and used to solve the problem of job shop scheduling. The algorithm was first introduced by Dorigo, Maniezzo and Colorni in 1991 and is derived from the foraging and recruiting behaviour observed in an ant colony. It can be applied to combinatorial optimisation problems. This paper outlines the algorithm’s implementation and performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2017
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2016.07.004